منابع مشابه
Design and Performance Analysis on Movement of Square, Triangular and Octagonal Structured Omnidirectional Mobile Robot
This paper addresses the issue of development of a three wheel, four wheels and eight wheel Omni directional mobile robot. The Omni directional wheel is used in this research consists of 8 rollers made from synthetic rubber coated polypropylene rollers. All Omni wheel are independently powered using 3, 4 and 8 units of precision gear DC motors and the wheel/ motors assemblies where mounted dire...
متن کاملShuffle on Array Languages Generated by Array Grammars
Motivated by the studies done by G. Siromoney et al. (1973) and Alexandru Mateescu et al. (1998) we examine the language theoretic results related to shuffle on trajectories by making use of Siromoney array grammars such as (R : R)AG, (R : CF )AG, (CF : R)AG, (CF : CF )AG, (CS : R)AG, (CS : CS)AG and (CF : CS)AG which are more powerful than the Siromoney matrix grammars (1972) and are used to m...
متن کاملAccepting Array Grammars with Control Mechanisms
We consider (n-dimensional) array grammars in the accepting mode with various control mechanisms and compare these families of array grammars with the corresponding families obtained by array grammars in the generating mode.
متن کاملContextual Array Grammars with Matrix and Regular Control
We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages. For d ≥ 2, d-dimensional contextual array grammars are less powerful than matrix contextual array grammars, which themselves are less powerful than contextual array grammars with regular control languages. Yet in the 1-dimensional case, for a one-letter alphabet, ...
متن کاملOne-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules
We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in array grammars. First we show that the emptiness problem for P systems with (one-dimensional) insertion rules is undecidable. Then we show computational completeness of P systems using (one-dimensional) array insertion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1770/1/012066